Scalable Scheduling for Clusters and Grids Using Cut through Switching

A new scalable scheduling strategy using cut through switching is proposed in this paper. Recursive and closed form expressions for speedup are found in heterogeneous single level trees and in homogeneous multilevel trees, respectively. The ratio of speedup using cut through switching to that using store and forward switching is presented so as to illustrate the amount of improvement in speedup between these two different techniques. Index Terms Cut through switching, Divisible load scheduling, Scalability, Multilevel tree network, Simultaneous distribution